منابع مشابه
Chained Boosting
We describe a method to learn to make sequential stopping decisions, such as those made along a processing pipeline. We envision a scenario in which a series of decisions must be made as to whether to continue to process. Further processing costs time and resources, but may add value. Our goal is to create, based on historic data, a series of decision rules (one at each stage in the pipeline) t...
متن کاملChained Vector Simplex
An algorithm for solving linear programming problems whose matrix of coefficients contains a large number of "zero" entries is studied. This algorithm is more useful when it is generated as a sub-program in a real-time program. The singly linked lists for storing only the non-zero entries of the coefficients matrix is used. The modified Revised Simplex Method is also used for solving such probl...
متن کاملOn Chained Cryptographic Puzzles
Cryptographic puzzles provide an elegant solution in combating denial of services attacks. In this paper we introduce the concept of chained cryptographic puzzle. We define two kinds of chained puzzle constructions: linearly chained puzzles and randomly chained puzzles. The first construction prove to be very useful in some scenarios, from which the more general is in which a client may choose ...
متن کاملOn Cryptographic Chained Puzzles
Cryptographic puzzles provide an elegant solution in combating denial of services attacks. In this paper we introduce the concept of chained puzzles and we define two kinds of chained puzzles: linearly chained puzzles and randomly chained puzzles. These construnstions prove to be very useful in some scenarios, from which the more general is in which a client may choose to solve only some of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1976
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1976.65.47